A generic approach to proving NP-hardness of partition type problems
نویسندگان
چکیده
منابع مشابه
On NP-hardness of the clique partition - Independence number gap recognition and related problems
We show that for a graph G it is NP-hard to decide whether its independence number (G) equals its clique partition number (G) even when some minimum clique partition of G is given. This implies that any (G)-upper bound provably better than (G) is NPhard to compute. To establish this result we use a reduction of the quasigroup completion problem (QCP, known to be NP-complete) to the maximum inde...
متن کاملA bright side of NP-hardness of interval computations: interval heuristics applied to NP-problems
It is known that interval computations are NP-hard. In other words, the solution of many important problems can be reduced to interval computations. The immediate conclusion is negative: in the general case, one cannot expect an algorithm to do all the interval computations in less than exponential running time. We show that this result also has a bright side: since there are many heuristics fo...
متن کاملUnimodality, Independence Lead to NP-Hardness of Interval Probability Problems
In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events, etc. – i.e., by characteristics c(p) which are linear in terms of the unknown probabilities pj . If we know interval bounds on some such characteristics ai ≤ ci(p) ≤ ai, and we are interested in a characteristic c(p),...
متن کاملfrom linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar
chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...
15 صفحه اولA Generic Approach to Constructing and Proving Verifiable Random Functions
Verifiable Random Functions (VRFs) as introduced by Micali, Rabin and Vadhan are a special form of Pseudo Random Functions (PRFs) wherein a secret key holder can also prove validity of the function evaluation relative to a statistically binding commitment. Prior works have approached the problem of constructing VRFs by proposing a candidate under a specific number theoretic setting — mostly in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2010
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.08.001